A Less Noise-Sensitive SDP Relaxation in Wireless Sensor Network Localization
نویسندگان
چکیده
There are variety of methods to solve the localization problem and among them semi-definite programming based methods have shown great performance in both complexity and accuracy aspects. In this paper, we introduce a class of less noise-sensitive relaxation to reduce the complexity of the SDP-based methods. We apply our relaxation to Edge-based Semidefinite Programming method (ESDP) and the resulted model called PESDP. Simulation results confirm that our proposed PESDP method is less noise-sensitive and faster compared to the original ESDP. Keywords—localization; wireless sensor networks; semidefinite programming.
منابع مشابه
Improve range-free localization accuracy in wireless sensor network using DV-hop and zoning
In recent years, wireless sensor networks have drawn great attention. This type of network is composed of a large number of sensor nodes which are able to sense, process and communicate. Besides, they are used in various fields such as emergency relief in disasters, monitoring the environment, military affairs and etc. Sensor nodes collect environmental data by using their sensors and send them...
متن کاملA multi-hop PSO based localization algorithm for wireless sensor networks
A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...
متن کاملA Gradient Search Method to Round the Semidefinite Programming Relaxation Solution for Ad Hoc Wireless Sensor Network Localization
In this report we develop an efficient and effective procedure to solve the distance geometry problem. This method is based on the semidefinite programming (SDP) relaxation proposed in [5, 6], and further improved by a gradient-based local search method. We first develop two alternative SDP relaxations for the distance geometry problem, which represent the (weighted) maximum-likelihood estimati...
متن کاملExploiting Sparsity in SDP Relaxation for Sensor Network Localization
A sensor network localization problem can be formulated as a quadratic optimization problem (QOP). For quadratic optimization problems, semidefinite programming (SDP) relaxation by Lasserre with relaxation order 1 for general polynomial optimization problems (POPs) is known to be equivalent to the sparse SDP relaxation by Waki et al. with relaxation order 1, except the size and sparsity of the ...
متن کاملOptimizing the Event-based Method of Localization in Wireless Sensor Networks
A Wireless Sensor Network (WSN) is a wireless decentralized structure network consists of many nodes. Nodes can be fixed or mobile. WSN applications typically observe some physical phenomenon through sampling of the environment so determine the location of events is an important issue in WSN. Wireless Localization used to determine the position of nodes. The precise localization in WSNs is a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014